package com.cmap;

import java.util.HashMap;

public class CMod {
    public static void main(String[] args) {
        bit();
        mod();

    }


    public static void bit() {
        int num = 10000 * 10;
        int a = 1;
        long start = System.currentTimeMillis();
        for (int i = num; i > 0; i++) {
            a &= i;
//            a  = a&i;
        }
        long end = System.currentTimeMillis();
        System.out.println("BIT耗时>>" + (end - start));

    }

    public static void mod() {
        int num = 10000 * 10;
        int a = 1;
        long start = System.currentTimeMillis();
        for (int i = num; i > 0; i++) {
            a %= i;
//            a = a%i;
        }
        long end = System.currentTimeMillis();
        System.out.println("MOD耗时>>" + (end - start));

    }

}
